import java.util.HashSet;

import java.util.*;
public class lk6291 {
    public static void main(String[] args) {
        int b[][]={{1,1,2,2},{0,0,1,1}};
        int c[][]=rangeAddQueries(2, b);
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                System.out.print(c[i][j]);
            }
            System.out.println("");
        }
    }
    public int differenceOfSum(int[] nums) {
        int n=nums.length;
        int all=0,all2=0;
        for(int i=0;i<n;i++){
            all+=nums[i];
            int a=nums[i];
            while(a!=0){
                all2+=a%10;
                a=a/10;
            }
        }
        return Math.abs(all-all2);
    }   
    public static int[][] rangeAddQueries(int n, int[][] queries) {
        int a[][]=new int[n][n];
        int t =queries.length;
        for(int i=0;i<t;i++){
            int x1=queries[i][0];
            int y1=queries[i][1];
            int x2=queries[i][2];
            int y2=queries[i][3];
            for(int p=x1;p<=x2;p++){
                for(int q=y1;q<=y2;q++){
                    a[p][q]+=1;
                }
            }
        }
        return a;
    }
}
